On Rigidity and the Isomorphism Problem for Tree Braid Groups

نویسنده

  • LUCAS SABALKA
چکیده

We solve the isomorphism problem for braid groups on trees with n = 4 or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations using the cohomology of tree braid groups, couching our discussion in the language of differential forms. Second, we show that, given a tree braid group BnT on n = 4 or 5 strands, H ∗(BnT ) is an exterior face algebra. Finally, we prove that one may reconstruct the tree T from a tree braid group BnT for n = 4 or 5. Among other corollaries, this third step shows that, when n = 4 or 5, tree braid groups BnT and trees T (up to homeomorphism) are in bijective correspondence. That such a bijection exists is not true for higher dimensional spaces, and is an artifact of the 1-dimensionality of trees. We end by stating the results for right-angled Artin groups corresponding to the main theorems, some of which do not yet appear in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anti-trees and right-angled Artin subgroups of braid groups

We prove that an arbitrary right-angled Artin group G admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, G admits quasi-isometric group embeddings into a pure braid group and into the area-preserving diffeomorphism groups of the 2–disk and the 2–sphere, answering questions due to Crisp–Wiest and M. Kapovich. Another co...

متن کامل

On the cycling operation in braid groups

The cycling operation is a special kind of conjugation that can be applied to elements in Artin’s braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In their seminal paper on braid-cryptography, Ko, Lee et al. proposed the cycling problem as a hard problem in braid groups that could be interesting for cryptograp...

متن کامل

Delta-structures on mapping class groups and braid groups

We describe a Delta-group structure on the mapping class groups of surfaces, and show that it is compatible with the Delta-group structures of the braid groups of surfaces given by Berrick-Cohen-Wong-Wu. We then prove an isomorphism theorem relating these two Delta-groups. This is the first of a pair of papers on this topic.

متن کامل

Characters of the Grothendieck-teichmüller Group through Rigidity of the Burau Representation

We present examples of characters of absolute Galois groups of number fields that can be recovered through their action by automorphisms on the profinite completion of the braid groups, using a “rigidity” approach. The way we use to recover them is through classical representations of the braid groups, and in particular through the Burau representation. This enables one to extend these characte...

متن کامل

Orbits of Braid Groups on Cacti

One of the consequences of the classification of finite simple groups is the fact that non-rigid polynomials (those with more than two finite critical values), considered as branched coverings of the sphere, have exactly three exceptional monodromy groups (one in degree 7, one in degree 13 and one in degree 15). By exceptional here we mean primitive and not equal to Sn or An, where n is the deg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008